CS 3110 Spring 2016 Lecture 1 : Introduction , Course Plan , Elements of OCaml : Syntax , Evaluation ( 1 / 28 )

CS 3110 Spring 2017 Lecture 25 : Course Review and Final Exam Coverage

Lecture 3: More reduction rules, the notion of Currying and Uncurrying, and typing rules for some of the constructs. A key signature idea of the ML family of languages is introduced, the polymorphic types which in this version of the course are written with both the standard OCaml syntax ‘a, ‘b, ‘c, ... and with Greek letters as in the original articles on ML, e.g. α, β, γ, .... It would be goo...

CS 3110 Spring 2016 Lecture 23 : Distributed Computing with Functional Processes continued

Topics 1. Message sequence diagrams and event structures. 2. A General Process Model (GPM) for asynchronous distributed computing. 3. Coding 2/3 consensus as a functional process. 4. A Logic of Events for reasoning about protocols. Reminders 1. Dr. Yaron Minksy will give the next lecture on Tuesday May 3. 2. PS6 is about distributed computing in OCaml, in particular implementing the 2/3 simple ...

CS 3110 Spring 2017 Lecture 22 : Distributed Computing with Functional Processes continued

Data Structures — Lecture Notes for CS 3110 : Design and Analysis of Algorithms

Geometric Complexity Theory: Introduction

Foreword These are lectures notes for the introductory graduate courses on geometric complexity theory (GCT) in the computer science department, the university of Chicago. Part I consists of the lecture notes for the course given by the first author in the spring quarter, 2007. It gives introduction to the basic structure of GCT. Part II consists of the lecture notes for the course given by the...